What is a \ Pointer Machine " ? Amir
نویسنده
چکیده
A \Pointer Machine" is many things. Authors who consider referring to this term are invited to read the following note rst.
منابع مشابه
Pointer Machines and Pointer Algorithms: an Annotated Bibliography
The term pointer machine has been used ambiguously in Computer Science literature. In this report we give precise deenitions of several models that have been referred to as \pointer machines" and list references for each of these models under the appropriate heading.
متن کاملAnalysis of Partitioned Global Address Space Programs
The introduction of multi-core processors by the major microprocessor vendors has brought parallel programming into the mainstream. Analysis of parallel languages is critical both for safety and optimization purposes. In this report, we consider the specific case of languages with barrier synchronization and global address space abstractions. Two of the fundamental problems in the analysis of p...
متن کاملHierarchical Pointer Analysis for Distributed Programs
We present a new pointer analysis for use in shared memory programs running on hierarchical parallel machines. The analysis is motivated by the partitioned global address space languages, in which programmers have control over data layout and threads and can directly read and write to memory associated with other threads. Titanium, UPC, Co-Array Fortran, X10, Chapel, and Fortress are all exampl...
متن کاملA Summary of: Storage Allocation for Embedded Processors[1]
Most embedded systems have their memory divided into several areas. Some memory are fast, some slower. Some areas might even require special machine instructions for access. By effectively using these different types of memory and pointer types, the authors hope to improve performance and size (also leading to lower energy consumption). The research problem is to select which variables should g...
متن کاملPointer chasing via triangular discrimination
We prove an essentially sharp Ω̃(n/k) lower bound on the k-round distributional complexity of the k-step pointer chasing problem under the uniform distribution, when Bob speaks first. This is an improvement over Nisan and Wigderson’s Ω̃(n/k2) lower bound. A key part of the proof is using triangular discrimination instead of total variation distance; this idea may be useful elsewhere.
متن کامل